Accelerated optimal maintenance scheduling for generation units on a truthful platform
نویسندگان
چکیده
Maintenance of generation units is a measure to ensure the reliability power systems. In this paper, novel blockchain-based truthful condition-based maintenance (T-CBMGU) platform proposed innovate and upgrade state-of-the-art CBMGU. addition, two valid inequalities are accelerate convergence speed Benders decomposition in scheduling process. The formulated based on technical/physical analysis greedy-based heuristic initialization. More specifically, for data acquisition failure rate diagnosis/prognosis processes, T-CBMGU can immutability collected operational data. way, influence tampered results CBMGU be reduced. For bidding change scheduled time slot CBMGU, decision makers, i.e., independent system operators (ISOs), may not trusted. However, T-CBMGU, processes implemented automatically via smart contracts rather than by ISOs; as such, incentives manipulate avoided. Finally, regarding performance actions, contrast implementation process truthfully recorded platform, which facilitates backtracking responsibility. Then, tested IEEE 300-bus system. Furthermore, cases with distrust caused fairness manipulation simulated show importance using T-CBMGU. algorithm compared other solvers demonstrate its fast speed.
منابع مشابه
On Designing Truthful Mechanisms for Online Scheduling
We study the online version of the scheduling problem Q||Cmax involving selfish agents, considered by Archer and Tardos in [FOCS 2001], where jobs must be scheduled on m related machines, each of them owned by a different selfish agent. We present a general technique for transforming competitive online algorithms for Q||Cmax into truthful online mechanisms with a small loss of competitiveness. ...
متن کاملA maintenance system model for optimal reconfigurable vibrating screen management
The reconfigurable vibrating screen (RVS) machine is an innovative beneficiation machine designed for screening different mineral particles of varying sizes and volumes required by the customers’ through the geometric transformation of its screen structure. The successful RVS machine upkeep requires its continuous, availability, reliability and maintainability. The RVS machine downtime, which c...
متن کاملTruthful algorithms for scheduling selfish tasks on parallel machines
We consider the problem of designing truthful mechanisms for scheduling selfish tasks (or agents)—whose objective is the minimization of their completion times—on parallel identical machines in order to minimize the makespan. A truthful mechanism can be easily obtained in this context (if we, of course, assume that the tasks cannot shrink their lengths) by scheduling the tasks following the inc...
متن کاملA unified approach to truthful scheduling on related machines
We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTAS’s) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the lp norm of the machine loads vector. Previously, this kind of result was only known for the makespan ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Reports
سال: 2022
ISSN: ['2352-4847']
DOI: https://doi.org/10.1016/j.egyr.2022.08.002